SERIE RESEARCH mEITlORBnun "STOP = RECIRCULATE" FOR EXPONENTIAL PRODUCT FORM QUEUEING NETWORKS WITH DEPARTURE BLOCKING

نویسنده

  • Nico M. van Dijk
چکیده

The blocking protocols of "stopping service" and of "recirculating" jobs through an entire system are shown to be equivalent for Jacksonian queueing networks with blocked departures. Queueing networks * product-form * stopping and recirculating blocking protocol •* partial balance.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

SERIE RESEARCH mEIHORnnDH ON "STOP = REPEAT" SERVICING FOR NON-EXPONENTIAL QUEUEING NETWORKS WITH BLOCKING

The communication blocking protocols of stopping or repeating a service in non-exponential queueing networks with blocking are shown to be equivalent under a partial balance condition. Examples both with a reversible and nonreversible routing are given.

متن کامل

SERIE RE5EHRCH mEmORMlDII PRODUCT FORMS FOR QUEUEING NETWORKS WITH LIMITED CLUSTERS

Queueing networks are considered with limited station clusters. A general characterization is given, in terms of local solutions of state dependent traffic equations, from which the existence and structure of a product form can be concluded. This characterization leads to new product form examples such as with a weak reversible cluster routing or a non-reversible routing both within and in betw...

متن کامل

SERIE RE5EHRCH mEmORRRDR

Bias terms of Markov reward structures are shown to play a key-role to conclude error bound or monotonicity results for steady state measures when dealing with approximate systems such as due to . perturbations . finite truncations . system modifications, or . system comparisons (bounds) The results are illustrated by a non-product form queueing network example with practical phenomena as block...

متن کامل

Maximum Entropy Analysis of Queueing Network Models

The principle of Maximum Entropy (ME) provides a consistent method of inference for estimating the form of an unknown discrete-state probability distribution, based on information expressed in terms of tree expected values. In this tutorial paper entropy maximisation is used to characterise product-form approximations and resolution algorithms for arbitrary continuoustime and discrete-time Queu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007